Computer verification of the Ankeny--Artin--Chowla Conjecture for all primes less than $100000000000$
نویسندگان
چکیده
منابع مشابه
Computer verification of the Ankeny-Artin-Chowla Conjecture for all primes less than 100 000 000 000
Let p be a prime congruent to 1 modulo 4, and let t, u be rational integers such that (t + u √ p )/2 is the fundamental unit of the real quadratic field Q(√p ). The Ankeny-Artin-Chowla conjecture (AAC conjecture) asserts that p will not divide u. This is equivalent to the assertion that p will not divide B(p−1)/2, where Bn denotes the nth Bernoulli number. Although first published in 1952, this...
متن کاملVerification of the Ankeny – Artin – Chowla Conjecture
Let p be a prime congruent to 1 modulo 4, and let t, u be rational integers such that (t + u √ p )/2 is the fundamental unit of the real quadratic field Q(√p ). The Ankeny-Artin-Chowla conjecture (AAC conjecture) asserts that p will not divide u. This is equivalent to the assertion that p will not divide B(p−1)/2, where Bn denotes the nth Bernoulli number. Although first published in 1952, this...
متن کاملCorrigenda and addition to "Computer verification of the Ankeny-Artin-Chowla conjecture for all primes less than 100 000 000 000"
An error in the program for verifying the Ankeny-Artin-Chowla (AAC) conjecture is reported. As a result, in the case of primes p which are ≡ 5 mod 8, the AAC conjecture has been verified using a different multiple of the regulator of the quadratic field Q(√p) than was meant. However, since any multiple of this regulator is suitable for this purpose, provided that it is smaller than 8p, the main...
متن کاملCongruences Related to the Ankeny-artin-chowla Conjecture
Let p be an odd prime with p ⌘ 1 (mod 4) and " = (t + upp)/2 > 1 be the fundamental unit of the real quadratic field K = Q(pp) over the rationals. The Ankeny-Artin-Chowla conjecture asserts that p u, which still remains unsolved. In this paper, we investigate various kinds of congruences equivalent to its negation p | u by making use of Dirichlet’s class number formula, the products of quadrati...
متن کاملON THE NUMBER OF PRIMES LESS THAN OR EQUAL x
(3) Z I"—1 log p = x log x + 0{x). r-ix\-pJ Since [x/^>]= [[#]/£], it is clear that (3) then holds for all real x>0. We propose to show in this note that the order of w(x) =the number of primes less than or equal x (a result originally due to Tschebyschef, cf. [l]) may be derived very quickly from (3) as a consequence of a general theorem which has no particular relationship to prime numbers. T...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 2000
ISSN: 0025-5718
DOI: 10.1090/s0025-5718-00-01234-5